What robots can do: robot programs and effective achievability
Identifieur interne : 002171 ( Main/Exploration ); précédent : 002170; suivant : 002172What robots can do: robot programs and effective achievability
Auteurs : Fangzhen Lin [Hong Kong] ; Hector J. Levesque [Hong Kong, Canada]Source :
- Artificial Intelligence [ 0004-3702 ] ; 1997.
Descripteurs français
- Wicri :
- topic : Robotique.
English descriptors
- KwdEn :
Abstract
In this paper, we propose a definition of goal achievability: given a basic action theory describing an initial state of the world and some primitive actions available to a robot, including some actions which return binary sensing information, what goals can be achieved by the robot? The main technical result of the paper is a proof that a simple robot programming language is universal, in that any effectively achievable goal can be achieved by getting the robot to execute one of the robot programs. The significance of this result is at least twofold. First, it is in many ways similar to the equivalence theorem between Turing machines and recursive functions, but applied to robots whose actions are specified by an action theory. Secondly, it provides formal justifications for using the simple robot programming language as a foundation for our work on robotics.
Url:
DOI: 10.1016/S0004-3702(98)00041-1
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002A99
- to stream Istex, to step Curation: 002887
- to stream Istex, to step Checkpoint: 001675
- to stream Main, to step Merge: 002288
- to stream Main, to step Curation: 002171
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">What robots can do: robot programs and effective achievability</title><author><name sortKey="Lin, Fangzhen" sort="Lin, Fangzhen" uniqKey="Lin F" first="Fangzhen" last="Lin">Fangzhen Lin</name></author><author><name sortKey="Levesque, Hector J" sort="Levesque, Hector J" uniqKey="Levesque H" first="Hector J." last="Levesque">Hector J. Levesque</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:632693AE6C6FB233AED119E244FBA3AAE15240E9</idno><date when="1998" year="1998">1998</date><idno type="doi">10.1016/S0004-3702(98)00041-1</idno><idno type="url">https://api.istex.fr/document/632693AE6C6FB233AED119E244FBA3AAE15240E9/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">002A99</idno><idno type="wicri:Area/Istex/Curation">002887</idno><idno type="wicri:Area/Istex/Checkpoint">001675</idno><idno type="wicri:doubleKey">0004-3702:1998:Lin F:what:robots:can</idno><idno type="wicri:Area/Main/Merge">002288</idno><idno type="wicri:Area/Main/Curation">002171</idno><idno type="wicri:Area/Main/Exploration">002171</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">What robots can do: robot programs and effective achievability</title><author><name sortKey="Lin, Fangzhen" sort="Lin, Fangzhen" uniqKey="Lin F" first="Fangzhen" last="Lin">Fangzhen Lin</name><affiliation wicri:level="1"><country wicri:rule="url">Hong Kong</country></affiliation><affiliation wicri:level="1"><country xml:lang="fr">Hong Kong</country><wicri:regionArea>Department of Computer Science, The Hong Kong University of Science and Technology</wicri:regionArea><wicri:noRegion>The Hong Kong University of Science and Technology</wicri:noRegion></affiliation></author><author><name sortKey="Levesque, Hector J" sort="Levesque, Hector J" uniqKey="Levesque H" first="Hector J." last="Levesque">Hector J. Levesque</name><affiliation wicri:level="1"><country wicri:rule="url">Hong Kong</country></affiliation><affiliation wicri:level="4"><country>Canada</country><wicri:regionArea>Department of Computer Science, University of Toronto, Toronto</wicri:regionArea><orgName type="university">Université de Toronto</orgName><placeName><settlement type="city">Toronto</settlement><region type="state">Ontario</region></placeName></affiliation></author></analytic><monogr></monogr><series><title level="j">Artificial Intelligence</title><title level="j" type="abbrev">ARTINT</title><idno type="ISSN">0004-3702</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="1997">1997</date><biblScope unit="volume">101</biblScope><biblScope unit="issue">1–2</biblScope><biblScope unit="page" from="201">201</biblScope><biblScope unit="page" to="226">226</biblScope></imprint><idno type="ISSN">0004-3702</idno></series><idno type="istex">632693AE6C6FB233AED119E244FBA3AAE15240E9</idno><idno type="DOI">10.1016/S0004-3702(98)00041-1</idno><idno type="PII">S0004-3702(98)00041-1</idno><idno type="ArticleID">98000411</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0004-3702</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Abilities</term><term>Achievability</term><term>Cognitive robotics</term><term>Effective achievability</term><term>Robot programs</term><term>Robotics</term><term>Situation calculus</term><term>Theories of actions</term></keywords><keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Robotique</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">In this paper, we propose a definition of goal achievability: given a basic action theory describing an initial state of the world and some primitive actions available to a robot, including some actions which return binary sensing information, what goals can be achieved by the robot? The main technical result of the paper is a proof that a simple robot programming language is universal, in that any effectively achievable goal can be achieved by getting the robot to execute one of the robot programs. The significance of this result is at least twofold. First, it is in many ways similar to the equivalence theorem between Turing machines and recursive functions, but applied to robots whose actions are specified by an action theory. Secondly, it provides formal justifications for using the simple robot programming language as a foundation for our work on robotics.</div></front></TEI><affiliations><list><country><li>Canada</li><li>Hong Kong</li></country><region><li>Ontario</li></region><settlement><li>Toronto</li></settlement><orgName><li>Université de Toronto</li></orgName></list><tree><country name="Hong Kong"><noRegion><name sortKey="Lin, Fangzhen" sort="Lin, Fangzhen" uniqKey="Lin F" first="Fangzhen" last="Lin">Fangzhen Lin</name></noRegion><name sortKey="Levesque, Hector J" sort="Levesque, Hector J" uniqKey="Levesque H" first="Hector J." last="Levesque">Hector J. Levesque</name><name sortKey="Lin, Fangzhen" sort="Lin, Fangzhen" uniqKey="Lin F" first="Fangzhen" last="Lin">Fangzhen Lin</name></country><country name="Canada"><region name="Ontario"><name sortKey="Levesque, Hector J" sort="Levesque, Hector J" uniqKey="Levesque H" first="Hector J." last="Levesque">Hector J. Levesque</name></region></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002171 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 002171 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= OcrV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:632693AE6C6FB233AED119E244FBA3AAE15240E9
|texte= What robots can do: robot programs and effective achievability
}}
| This area was generated with Dilib version V0.6.32. |  |